Solving an inverse elliptic coefficient problem by convex non-linear semidefinite programming

نویسندگان

چکیده

Abstract Several applications in medical imaging and non-destructive material testing lead to inverse elliptic coefficient problems, where an unknown function PDE is be determined from partial knowledge of its solutions. This usually a highly non-linear ill-posed problem, for which unique reconstructability results, stability estimates global convergence numerical methods are very hard achieve. The aim this note point out new connection between problems semidefinite programming that may help addressing these challenges. We show Robin transmission problem with finitely many measurements can equivalently rewritten as uniquely solvable convex optimization problem. allows explicitly estimate the number required achieve desired resolution, derive error noisy data, overcome local minima appears optimization-based approaches problems.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Recurrent Neural Network Model for Solving Linear Semidefinite Programming

In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...

متن کامل

Solving a non-convex non-linear optimization problem constrained by fuzzy relational equations and Sugeno-Weber family of t-norms

Sugeno-Weber family of t-norms and t-conorms is one of the most applied one in various fuzzy modelling problems. This family of t-norms and t-conorms was suggested by Weber for modeling intersection and union of fuzzy sets. Also, the t-conorms were suggested as addition rules by Sugeno for so-called  $lambda$–fuzzy measures. In this paper, we study a nonlinear optimization problem where the fea...

متن کامل

Solving an Inverse Heat Conduction Problem by Spline Method

In this paper, a numerical solution of an inverse non-dimensional heat conduction problem by spline method will be considered. The given heat conduction equation, the boundary condition, and the initial condition are presented in a dimensionless form. A set of temperature measurements at a single sensor location inside the heat conduction body is required. The result show that the proposed meth...

متن کامل

Generating Non-linear Interpolants by Semidefinite Programming

Interpolation-based techniques have been widely and successfully applied in the verification of hardware and software, e.g., in bounded-model checking, CEGAR, SMT, etc., whose hardest part is how to synthesize interpolants. Various work for discovering interpolants for propositional logic, quantifier-free fragments of first-order theories and their combinations have been proposed. However, litt...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Optimization Letters

سال: 2021

ISSN: ['1862-4480', '1862-4472']

DOI: https://doi.org/10.1007/s11590-021-01802-4